Fields, towers of function fields meeting asymptotic bounds, and basis constructions for algebraic-geometric codes

نویسنده

  • Vinay Deolalikar
چکیده

In this work, we use the notion of “symmetry” of functions for an extension K/L of finite fields to produce extensions of a function field F/K in which almost all places of degree one split completely. Then we introduce the notion of “quasi-symmetry” of functions for K/L, and demonstrate its use in producing extensions of F/K in which all places of degree one split completely. Using these techniques, we are able to restrict the ramification either to one chosen rational place, or entirely to non-rational places. We then apply these methods to the related problem of building asymptotically good towers of function fields. We construct examples of towers of function fields in which all rational places split completely throughout the tower. We construct Abelian towers with this property also. We also generalize two existing examples of towers of function fields meeting the Drinfeld-Vladut bound, resulting in two infinite families of such towers. We obtain results on the existence of Abelian extensions of arbitrary characteristic power degree in which all rational places split completely, as well as non-Abelian extensions of arbitrarily high degree in which the same holds true. Furthermore, all of the above are done explicitly, i.e., we give generators for the extensions, and equations that they satisfy. We also construct an integral basis for a set of places in a tower of function fields meeting the Drinfeld-Vladut bound using the discriminant of the tower localized at each place. Thus we are able to obtain a basis for a collection of functions that contains the set of regular functions in this tower. Regular functions are of interest in the theory of error-correcting codes as they lead to an explicit description of the code associated to the tower by providing the code’s generator matrix.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON CURVES OVER FINITE FIELDS by

— In these notes we present some basic results of the Theory of Curves over Finite Fields. Assuming a famous theorem of A. Weil, which bounds the number of solutions in a finite field (i.e., number of rational points) in terms of the genus and the cardinality of the finite field, we then prove several other related bounds (bounds of Serre, Ihara, Stohr-Voloch, etc.). We then treat Maximal Curve...

متن کامل

Constructions and bounds on linear error-block codes

We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We obtain a Gilbert–Varshamov type construction. Using our bounds and constructions we obtain some infinite families of optimal linear error-block codes over F2. We also study the asymptotic of linear error-block codes. We define the real valued function αq,m,a(δ), which is an analog of the importa...

متن کامل

Constructions of Codes from Number Fields

We define number-theoretic error-correcting codes based on algebraic number fields, thereby providing a generalization of Chinese Remainder Codes akin to the generalization of ReedSolomon codes to Algebraic-geometric codes. Our construction is very similar to (and in fact less general than) the one given by Lenstra [9], but the parallel with the function field case is more apparent, since we on...

متن کامل

Galois Towers over Non-prime Finite Fields

In this paper we construct Galois towers with good asymptotic properties over any nonprime finite field F`; i.e., we construct sequences of function fields N = (N1 ⊂ N2 ⊂ · · · ) over F` of increasing genus, such that all the extensions Ni/N1 are Galois extensions and the number of rational places of these function fields grows linearly with the genus. The limits of the towers satisfy the same ...

متن کامل

Delta sets for divisors supported in two points

In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well as improved thresholds for algebraic geometric linear secret sharing schemes. The coset bounds depend on the choice of a sequence of divisors and on its intersection with a given set of divisors called a delta set. In t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000